On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quasi-reductivity of Logically Constrained Term Rewriting Systems

The formal framework of Logically Constrained Term Rewriting Systems (LCTRSs), introduced in [Kop and Nishida 2013], combines term rewriting with constraints and calculations over an arbitrary theory. This for instance allows users to specify rules with integers, arrays and strings, and can be used to analyze both imperative and functional programs (without higher-order variables) in a natural ...

متن کامل

Transforming Cycle Rewriting into String Rewriting

We present new techniques to prove termination of cycle rewriting, that is, string rewriting on cycles, which are strings in which the start and end are connected. Our main technique is to transform cycle rewriting into string rewriting and then apply state of the art techniques to prove termination of the string rewrite system. We present three such transformations, and prove for all of them t...

متن کامل

Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars

The type of a minimalist grammar (MG) as introduced by Stabler [11, 12] provides an attempt of a rigorous algebraic formalization of the new perspectives adopted within the linguistic framework of transformational grammar due to the change from GB–theory to minimalism. Michaelis [6] has shown that MGs constitute a subclass of mildly context–sensitive grammars in the sense that for each MG there...

متن کامل

Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems

Deterministic conditional rewrite systems are interesting because they permit extra variables on the right-hand sides of the rules. If such a system is quasi-reductive, then it is terminating and has a computable rewrite relation. It will be shown that every deterministic CTRS R can be transformed into an unconditional TRS U(R) such that termination of U(R) implies quasi-reductivity of R. The m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2019

ISSN: 2075-2180

DOI: 10.4204/eptcs.289.3